A New Upper Bound for the Dimension of Trace Codes
نویسنده
چکیده
We shall derive a new non-trivial upper bound for the dimension of trace codes connected to algebraicgeometric codes. Furthermore, we shall deduce their true dimension if certain conditions are satisfied.
منابع مشابه
Upper bounds for noetherian dimension of all injective modules with Krull dimension
In this paper we give an upper bound for Noetherian dimension of all injective modules with Krull dimension on arbitrary rings. In particular, we also give an upper bound for Noetherian dimension of all Artinian modules on Noetherian duo rings.
متن کاملNew few weight codes from trace codes over a local Ring
In this paper, new few weights linear codes over the local ring R = Fp+uFp+vFp+uvFp, with u2 = v2 = 0, uv = vu, are constructed by using the trace function defined over an extension ring of degree m. These trace codes have the algebraic structure of abelian codes. Their weight distributions are evaluated explicitly by means of Gaussian sums over finite fields. Two different defining sets are ex...
متن کاملبهبود کران بالا روی بعد همدیس میدانهای اولیه
Modular invarinat, constraints the spectrum of the theory. Using the medum temprature expansion, for first and third order of derivative, a universal upper bound on the lowest primary field has been obtained in recent researches. In this paper, we will improve the upper bound on the scaling dimension of the lowest primary field. We use by the medium temprature expansion for an arbitrary orders...
متن کاملAn Upper Bound Solution for Analysis of Twist Extrusion Process with Elliptical Die Cross-section
Twist extrusion process is a rather new route to produce highly strained materials. In this process, severe plastic deformation is applied by large shear strains. In current article, required energy for twist extrusion by use of admissible velocity field together with the upper bound technique is predicted. The proposed model is capable of considering the effect of various parameters such as di...
متن کاملA Singleton Bound for Lattice Schemes
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a Singleton bound for subspace codes mimic the technique used in obtaining the Singleton bound for binary codes. This motivates the question of whether there is an abstract framework that captures these similarities. As a first step towards answering this question, we use ...
متن کامل